Linear Size Binary Space Partitions for Uncluttered Scenes
نویسندگان
چکیده
منابع مشابه
Binary Space Partitions for Axis - Parallel Line Segments : Size - Height
We present worst-case lower bounds on the minimum size of a binary space partition (BSP) tree as a function of its height, for a set S of n axis-parallel line segments in the plane. We assume that the BSP uses only axis-parallel cutting lines. These lower bounds imply that, in the worst case, a BSP tree of height O(log n) must have size (n log n) and a BSP tree of size O(n) must have height (n)...
متن کاملBinary Space Partitions
Binary Space Partitions Name: Adrian Dumitrescu, Csaba D. Tóth Affil./Addr. 1: Computer Science, Univ. of Wisconsin–Milwaukee, Milwaukee, WI, USA Affil./Addr. 2: Mathematics, California State University Northridge, Los Angeles, CA, USA Affil./Addr. 3: Computer Science, Tufts University, Medford, MA, USA
متن کاملLinear Binary Space Partitions and the Hierarchy of Object Classes
We consider the problem of constructing binary space partitions for the set P of d-dimensional objects in d-dimensional space. There are several classes of objects defined for such settings that support the design of effective algorithms. We extend the existing de Berg hierarchy of classes [4] by defining new classes based on old ones and we show the desirability of such an extension. Moreover ...
متن کاملBinary Space Partitions for Fat Rectangles
We consider the practical problem of constructing binary space partitions (BSPs) for a set S of n orthogonal, nonintersecting, two-dimensional rectangles in IR3 such that the aspect ratio of each rectangle in S is at most , for some constant 1. We present an n2O(plogn )-time algorithm to build a binary space partition of size n2O(plogn ) for S. We also show that if m of the n rectangles in S ha...
متن کاملBinary Space Partitions: Recent Developments
A binary space partition tree is a data structure for the representation of a set of objects in space. It found an increasing number of applications over the last decades. In recent years, intensifying research focused on its combinatorial properties, which affect directly the efficiency of applications. Important advances were made on binary space partitions for disjoint line segments in the p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2000
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s004530010047